A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
نویسنده
چکیده
This paper presents a Branch and Bound method for a nonconvex integer quadratic programming problem with a separable objective function over a bounded box. For this problem, a special branch method is constructed, which has a property that if a box has been partitioned into 2 sub-boxes, then at least one sub-box can be deleted. We analyze the complexity of the algorithm, and prove that it is better than that of the complete enumeration method in the worst case if the solution space is large enough. © 2004 Elsevier Inc. All rights reserved.
منابع مشابه
Nonconvex Global Optimization for Latent-Variable Models
Many models in NLP involve latent variables, such as unknown parses, tags, or alignments. Finding the optimal model parameters is then usually a difficult nonconvex optimization problem. The usual practice is to settle for local optimization methods such as EM or gradient ascent. We explore how one might instead search for a global optimum in parameter space, using branch-and-bound. Our method ...
متن کاملSemidefinite relaxations for non-convex quadratic mixed-integer programming
We present semidefinite relaxations for unconstrained nonconvex quadratic mixed-integer optimization problems. These relaxations yield tight bounds and are computationally easy to solve for mediumsized instances, even if some of the variables are integer and unbounded. In this case, the problem contains an infinite number of linear constraints; these constraints are separated dynamically. We us...
متن کاملInterior Point Methods for Combinatorial Optimization
Research on using interior point algorithms to solve combinatorial optimization and integer programming problems is surveyed. This paper discusses branch and cut methods for integer programming problems, a potential reduction method based on transforming an integer programming problem to an equivalent nonconvex quadratic programming problem, interior point methods for solving network flow probl...
متن کاملConcave Quadratic Cuts for Mixed-Integer Quadratic Problems
The technique of semidefinite programming (SDP) relaxation can be used to obtain a nontrivial bound on the optimal value of a nonconvex quadratically constrained quadratic program (QCQP). We explore concave quadratic inequalities that hold for any vector in the integer lattice Z, and show that adding these inequalities to a mixed-integer nonconvex QCQP can improve the SDP-based bound on the opt...
متن کاملSemidefinite Cuts and Partial Convexification Techniques with Applications to Continuous Nonconvex Optimization, Stochastic Integer Programming, and Facility Layout Problems
(ABSTRACT) Despite recent advances in convex optimization techniques, the areas of discrete and continuous nonconvex optimization remain formidable, particularly when globally optimal solutions are desired. Most solution techniques, such as branch-and-bound, are enumerative in nature, and the rate of their convergence is strongly dependent on the accuracy of the bounds provided, and therefore, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 70 شماره
صفحات -
تاریخ انتشار 2005